#include<bits/stdc++.h>
using namespace std;
#define ll long long
// #define int ll
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repd(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define forn(i,a,b) for(int i=(int)(a);i<=(int)(b);++i)
#define ford(i,a,b) for(int i=(int)(b);i>=(int)(a);--i)
#define all(S) (S).begin(),(S).end()
#define pb push_back
#define INF 0x3f3f3f3f
#define modcg(x) if(x>=mod)x-=mod
#define modcl(x) if(x<0)x+=mod
//============================================================================================
const int MAXN=1e5+10;
int n;
int a[MAXN];
void SOLVE()
{
    cin>>n;
    forn(i,1,n)
    {
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    int l=1;
    forn(i,1,n)
    {
        if(a[l]<a[i])
        {
            l++;
        }
    }
    cout<<n-l+1<<endl;
}
signed main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin.tie(0);cout.tie(0);std::ios::sync_with_stdio(0);
    int TEST_CASE=1;
    // cin>>TEST_CASE;
    while(TEST_CASE--)
    {
        SOLVE();
    }
    return 0;
}